A ‘Natural Logic’ inference system using the Lambek calculus
Identifieur interne : 005542 ( Main/Exploration ); précédent : 005541; suivant : 005543A ‘Natural Logic’ inference system using the Lambek calculus
Auteurs : Anna Zamansky [Israël] ; Nissim Francez [Israël] ; Yoad Winter [Israël]Source :
- Journal of Logic, Language and Information [ 0925-8531 ] ; 2006-10-01.
English descriptors
- KwdEn :
Abstract
Abstract: This paper develops an inference system for natural language within the ‘Natural Logic’ paradigm as advocated by van Benthem (1997), Sánchez (1991) and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek-based system we propose extends the system by Fyodorov et~al. (2003), which is based on the Ajdukiewicz/Bar-Hillel (AB) calculus Bar Hillel, (1964). This enables the system to deal with new kinds of inferences, involving relative clauses, non-constituent coordination, and meaning postulates that involve complex expressions. Basing the system on the Lambek calculus leads to problems with non-normalized proof terms, which are treated by using normalization axioms.
Url:
DOI: 10.1007/s10849-006-9018-x
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002439
- to stream Istex, to step Curation: 002408
- to stream Istex, to step Checkpoint: 001395
- to stream Main, to step Merge: 005688
- to stream Main, to step Curation: 005542
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A ‘Natural Logic’ inference system using the Lambek calculus</title><author><name sortKey="Zamansky, Anna" sort="Zamansky, Anna" uniqKey="Zamansky A" first="Anna" last="Zamansky">Anna Zamansky</name></author><author><name sortKey="Francez, Nissim" sort="Francez, Nissim" uniqKey="Francez N" first="Nissim" last="Francez">Nissim Francez</name></author><author><name sortKey="Winter, Yoad" sort="Winter, Yoad" uniqKey="Winter Y" first="Yoad" last="Winter">Yoad Winter</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9BC89FE9CD9884869CA49359E2F41C4296D9B3F3</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/s10849-006-9018-x</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-V9JC34GD-M/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002439</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002439</idno><idno type="wicri:Area/Istex/Curation">002408</idno><idno type="wicri:Area/Istex/Checkpoint">001395</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001395</idno><idno type="wicri:doubleKey">0925-8531:2006:Zamansky A:a:natural:logic</idno><idno type="wicri:Area/Main/Merge">005688</idno><idno type="wicri:Area/Main/Curation">005542</idno><idno type="wicri:Area/Main/Exploration">005542</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A ‘Natural Logic’ inference system using the Lambek calculus</title><author><name sortKey="Zamansky, Anna" sort="Zamansky, Anna" uniqKey="Zamansky A" first="Anna" last="Zamansky">Anna Zamansky</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>School of Computer Science, Tel-Aviv University, Ramat-Aviv</wicri:regionArea><wicri:noRegion>Ramat-Aviv</wicri:noRegion></affiliation></author><author><name sortKey="Francez, Nissim" sort="Francez, Nissim" uniqKey="Francez N" first="Nissim" last="Francez">Nissim Francez</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Computer Science Faculty, Technion - IIT, Haifa</wicri:regionArea><wicri:noRegion>Haifa</wicri:noRegion></affiliation></author><author><name sortKey="Winter, Yoad" sort="Winter, Yoad" uniqKey="Winter Y" first="Yoad" last="Winter">Yoad Winter</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Computer Science Faculty, Technion - IIT, Haifa</wicri:regionArea><wicri:noRegion>Haifa</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Logic, Language and Information</title><title level="j" type="abbrev">JoLLI</title><idno type="ISSN">0925-8531</idno><idno type="eISSN">1572-9583</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2006-10-01">2006-10-01</date><biblScope unit="volume">15</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="273">273</biblScope><biblScope unit="page" to="295">295</biblScope></imprint><idno type="ISSN">0925-8531</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0925-8531</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Inference</term><term>Lambek calculus</term><term>Natural logic</term><term>Normalization</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper develops an inference system for natural language within the ‘Natural Logic’ paradigm as advocated by van Benthem (1997), Sánchez (1991) and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek-based system we propose extends the system by Fyodorov et~al. (2003), which is based on the Ajdukiewicz/Bar-Hillel (AB) calculus Bar Hillel, (1964). This enables the system to deal with new kinds of inferences, involving relative clauses, non-constituent coordination, and meaning postulates that involve complex expressions. Basing the system on the Lambek calculus leads to problems with non-normalized proof terms, which are treated by using normalization axioms.</div></front></TEI><affiliations><list><country><li>Israël</li></country></list><tree><country name="Israël"><noRegion><name sortKey="Zamansky, Anna" sort="Zamansky, Anna" uniqKey="Zamansky A" first="Anna" last="Zamansky">Anna Zamansky</name></noRegion><name sortKey="Francez, Nissim" sort="Francez, Nissim" uniqKey="Francez N" first="Nissim" last="Francez">Nissim Francez</name><name sortKey="Winter, Yoad" sort="Winter, Yoad" uniqKey="Winter Y" first="Yoad" last="Winter">Yoad Winter</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005542 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005542 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:9BC89FE9CD9884869CA49359E2F41C4296D9B3F3
|texte= A ‘Natural Logic’ inference system using the Lambek calculus
}}
| This area was generated with Dilib version V0.6.33. |  |